Probabilistic harmonic-function-based method for robot motion planning
نویسندگان
چکیده
This paper presents a robot motion planning method, called PHM, that uses a random sampling scheme together with a potential-field approach based on harmonic functions. The combination of both results in an efficient path planner that is both resolution and probabilistic complete. On one hand, random sampling allows the use of the harmonic functions approach without the explicit knowledge of the robot’s Configuration Space. On the other hand, harmonic functions allow an intelligent sampling of Configuration Space by introducing a bias towards the more promising regions.
منابع مشابه
Direct Optimal Motion Planning for Omni-directional Mobile Robots under Limitation on Velocity and Acceleration
This paper describes a low computational direct approach for optimal motion planning and obstacle avoidance of Omni-directional mobile robots within velocity and acceleration constraints on the robot motion. The main purpose of this problem is the minimization of a quadratic cost function while limitation on velocity and acceleration of robot is considered and collision with any obstacle in the...
متن کاملPath Planning for Mobile Robot with Half-sweep Successive Over- Relaxation (hssor) Iterative Method
This paper describes our work in solving path planning problem for mobile robot by using harmonic functions to generate path in the configuration space. Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. T...
متن کاملTowards a Probabilistic Roadmap for Multi-robot Coordination
In this paper, we discuss the problem of multirobot coordination and propose an approach for coordinated multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, called ACS-PRM, is a samplingbased method and consists of three steps including Cspace sampling, roadmap building and motion planning. In contrast to previous app...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملACS-PRM: Adaptive Cross Sampling Based Probabilistic Roadmap for Multi-robot Motion Planning
In this paper we present a novel approach for multi-robot motion planning by using a probabilistic roadmap (PRM) based on adaptive cross sampling (ACS). The proposed approach, we call ACSPRM, consists of three steps, which are C-space sampling, roadmap building and motion planning. Firstly, an adequate number of points should be generated in C-space on an occupancy grid map by using an adaptive...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003